SEMIGROUPS WITH if–then–else AND HALTING PROGRAMS
نویسندگان
چکیده
منابع مشابه
De-Quantising Non-Halting Programs
Since many real-world problems arising in the fields of compiler optimisation, automatised software engineering, formal proof systems, and so forth are equivalent to the Halting Problem—the most notorious undecidable problem—there is a growing interest, not only academically, in understanding the problem better and in providing alternative solutions. Halting computations can be recognised by si...
متن کاملBreakpoints and Halting in Distributed Programs
Interactive debugging requires that the programmer be able to halt a program at interesting points in its execution. This paper presents an algorithm for halting a distributed program in a consistent state, and presents a definition of distributed breakpoints with an algorithm for implementing the detection of these breakpoints. The Halting Algorithm extends Chandy and Lamport’s algorithm for r...
متن کاملHalting sets of programs over an algebra
We show that the halting set of a program over a (possibly partial) universal algebra A is a countable directed union of basic sets, where a basic set is a subset of (a power of) A, definable by a conjunction of atomic and negated atomic formulae in the first order language of A. IfA is “satisfaction semicomplete”, and standard Peano arithmetik can be defined in A then the halting sets of progr...
متن کاملSizes of Halting Testers for Programs of Bounded Size
It is known that for every programming language satisfying some reasonable conditions, there is a constant c such that for every n, a halting tester of size no more than n + c exists that correctly halt-tests all programs of size up to n with the empty input. In this submission Busy Beaver techniques are used to show that there is a constant d such that each halting tester of the above kind is ...
متن کاملThe Halting Problem for Deductive Synthesis of Logic Programs
Deductive synthesis methods derive programs in an incremental manner, and therefore pose a halting problem { when can synthesis stop with a correct program? We give a characterisation of this problem and state a halting principle as a solution. Another characteristic of deductive synthesis is that it may derive several correct programs, giving rise to another question { which correct programs a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Algebra and Computation
سال: 2009
ISSN: 0218-1967,1793-6500
DOI: 10.1142/s0218196709005354